A Parallel Architecture for Constraint Satisfaction
نویسنده
چکیده
The Constraint Satisfaction Problem (CSP) has been a useful model for various industrial and engineering applications. These include image processing and pattern recognition, VLSI engineering, robotics manipulation, and computer hardware design automation. In this paper , we give a novel AI architecture for discrete relaxation that eeectively prunes a backtracking search tree in CSP. This algorithm has been implemented on a ne-grained, massively parallel hardware computer architecture. For practical application problems, many orders of magnitude of eeciency improvement can be reached on this hardware architecture. This enables real-time processing of a large class of practical problems.
منابع مشابه
Lessons Learned from Prototyping Parallel Computer Architectures for AI Algorithms
Since many years algorithms from the eld of arti cial intelligence (AI) have been targeted for parallelization, i.e., partitioning the search problem and distributing the subproblems among multiple processing nodes. This paper reports on our experience in parallelizing and distributing AI algorithms, i.e., the design and prototype implementation of parallel computer architectures for AI algorit...
متن کاملDomain Decomposition for Parallel Resolution of Constraint Satisfaction Problems with OpenMP
Many problems in computer science, especially in Artificial Intelligence, can be represented as constraint satisfaction problems (CSP). For example, scene labeling in computer vision involves testing possible interpretation of objects against relation rules. Other constraint satisfaction problems include theorem proving, scheduling, expert systems. These problems are typically NP-Complete becau...
متن کاملAn event-based architecture for solving constraint satisfaction problems
Constraint satisfaction problems are ubiquitous in many domains. They are typically solved using conventional digital computing architectures that do not reflect the distributed nature of many of these problems, and are thus ill-suited for solving them. Here we present a parallel analogue/digital hardware architecture specifically designed to solve such problems. We cast constraint satisfaction...
متن کاملA Parallel Architecture for Solving Constraint Satisfaction Problems
Real world problems can often be described by a set of constraints to be satisfied, where the goal is to find a feasible solution for the problem. The use of constraints allows one to model a wide variety of problems in a straightforward manner. However, finding a solution that either satisfies all constraints or maximizes some benefit is usually difficult, as existing algorithms for both probl...
متن کاملParallel and distributed algorithms for finite constraint satisfaction problems
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model and a distributed algorithm for networks of interconnected processors. I f an FCSP can be represented b y an acyclic constraint network of sire n with width bounded b y a constant then (1) the parallel algorithm takes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991